Classifying Computational Counting Problems
Pinyan Lu (Shanghai University of Finance and Economics)
24-Dec-2020, 07:00-08:00 (5 years ago)
Abstract: Abstract: The main theme of theoretical computer science is to classify various computational problems in terms of their inherent computational difficulty. In this talk, I will try to demonstrate this general theme by some cases study of my own research on the algorithms and complexity for counting problems defined on graphs.
combinatorics
Audience: researchers in the topic
Comments: pw 030303
Series comments: Check scmscomb.github.io/ for more information
Export talk to